Concurrent Parsing In Programmable Logic Array (PLA-) Nets Problems And Proposals
نویسنده
چکیده
This contribution attempts a conceptual and practical introduction into the principles of wiring or constructing special machines for language processing tasks instead of programming a universal machine. Construction would in principle provide higher descriptive adequacy in computationally based linguistics. After all, our heads do not apply programs on stored symbol arrays but are appropriately wired for understanding or producing language. Introductor~ Remarks i. For me, computational linguistics is not primarily a technical discipline implementing performance processes for independently defined formal structures of linguistic competence. Computational linguistics should be a foundational discipline: It should be related to processoriented linguistics as the theory of logical calculi is to formal linguistics (e.g. generative linguistics, Montague-grammars etc.). 2. As it stands, computational linguistics does not yet meet the requirements for a foundational discipline. Searle's arguments against the claims of artificial intelligence apply fully to computational linguistics: Programmed solutions of tasks may execute the task satisfactorily without giving a model of its execution in the organism. Our intentional linguistic acts are caused by and realized in complicated concurrent processes occcurring in networks of neurons and are experienced as spontaneous. This also applies to special cases such as the recognition of syntactic structure (parsing). These processes are not controlled and executed by central processor units. 3. Computational linguistics must meet the challenge to satisfy the double criterion of descriptive adequacy: Adequacy in the description of what human beings do (e.g. parsing) and adequacy in the description of ho__~w they do it (namely by spontaneous concurrent processes corresponding to unconscious intuitive understanding). It must try to meet the challenge to provide the foundations for a descriptively and explanatorily adequate process-oriented linguistic, even when it is clear that the presently available conceptual means for describing complicated concurrent processes mainly the elements of computer architecture are far less understood than programming theory and programming technique. 4. Note: It does not stand to question that there is any problem which, in principle, could not be solved by programming. It is simply the case that almost all solutions are descriptively inadequate for representing and understanding what goes on in human beings even where they provide an adequate representation of input output relations and would thus pass Turing's test. 5. In my opinion, the main features to be realized in more adequate computational systems are concurrency of localized operations (instead of centrally controlled sequential processes), and signal processing (instead of symbol manipulation). These features cannot be represented by a program on an ordinary von Neumann machine since this type of machine is by definition a sequential,centrally controlled symbol manipulator. This does not exclude that programs may simulate concurrent processes. For instance, programs for testing gate array designs are of this kind. But simulating programs must clearly separate the features they simulate from the features which are only specific for their sequential operation. Electronic worksheet programs (in particular those used for planning and testing of gate arrays) are appropriate simulators of this type since their display on the monitor shows the network and signal flow whereas the specifics of program execut/on are concealed from the user. 6. How should computational linguistics be developed to meet the challenge? I think that the general method has already been specified by yon Neumann and Burks in their attempt to compare behavior and structure in computers and brains in terms of cellular automata. They have shown in this context that we have always two alternatives: Solutions for tasks can be realized by programs to be executed on an universal centrally controlled (von Neumann) machine, or they can be realized by constructing a machine. Since ordinary i.e. non-cellular-von-Neumann machines are sequential, realization of concurrent processes can only be approached by constructing (or describing the construction of such a system, e.g. the brain).
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملPla Decomposition to Reduce the Cost of Concurrent Checking
In this paper 1 we propose a combination of PLA decomposition and unidirectional error detecting techniques which permits concurrent testing for all single faults in a circuit (both in the decomposed modules and on the interconnection lines), for a lower area overhead cost than is normally associated with unidirectional error detecting codes.
متن کاملRecent Topics on Programmable Logic Array
The programmable logic array (PLA) is a basic and important building circuit for VLSI chips. After recent improvement techniques on PLA, PLA becomes more attractive for designers especially in GHz technology with deep sub-micron sizing. In this paper we will try to introduce the cross-talk problem solution in DSM, in PLA Network and also try to give the usage of PLA in GHz technology and the ad...
متن کاملMultiple-Valued PLA Minimization by Concurrent Multiple and Mixed Simulated Annealing
We analyze simulated annealing applied to multiple-valued programmable logic array (MVL PLA) design. Of spec@c interest is the use of parallel processors. We consider the use of loosely-coupled, coarsegrainedparallel systems, and study the relationship between the quality of the solution and computation time, on the one hand, and simulated annealing parameters, start temperature, cooling rate, ...
متن کاملOptimizing Programmable Logic Arrays Using the Simulated Annealing Algorithm
In the paper the programmable logic array (PLA) topological optimization problem is dealt with using folding techniques. A PLA folding algorithm based on the method of simulated annealing is presented. A simulated-annealing PLA folding algorithm is presented for multiple unconstrained folding. Then, the algorithm is extended to handle constrained folding. In this way, simple folding is consider...
متن کاملFACTPLA : functional analysis and the complexity of testing programmable logic array
A computer aided method for analyzing the testability of Programmable Logic Arrays (PLAs) is described. The method, which is based on a functional verification approach, estimates the complexity of testing a PLA according to the amount of single undetectable faults in the array structure. An analytic program (FACTPLA) is developed to predict the above complexity without analyzing the topology o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1984